翻訳と辞書 Words near each other ・ Leverhulme Trust ・ Leverian collection ・ Leverich Park ・ Levering Act ・ Levering Hall ・ Levering Mission ・ Levenmouth rail link ・ Levenov Point ・ Levens ・ Levens Hall ・ Levens, Cumbria ・ Levensau ・ Levensau High Bridge ・ Levenshtein automaton ・ Levenshtein coding ・ Levenshtein distance ・ Levenshulme ・ Levenshulme High School ・ Levenshulme railway station ・ Levenshulme South railway station ・ Levenson ・ Levenson Self-Report Psychopathy Scale ・ Levenspiel plot ・ Levenstein ・ Levent ・ Levent (Istanbul Metro) ・ Levent (name) ・ Levent Ayçiçek ・ Levent Devrim ・ Levent Ersöz Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Levenshtein distance ： ウィキペディア英語版 Levenshtein distance In information theory and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other. It is named after Vladimir Levenshtein, who considered this distance in 1965.〔 Appeared in English as: 〕 Levenshtein distance may also be referred to as edit distance, although that may also denote a larger family of distance metrics. It is closely related to pairwise string alignments. == Definition == Mathematically, the Levenshtein distance between two strings $a,\; b$ (of length $|a|$ and $|b|$ respectively) is given by $\backslash operatorname\_(|a|,|b|)$ where :$\backslash qquad\backslash operatorname\_(i,j)\; =\; \backslash begin$ \max(i,j) & \text \min(i,j)=0, \\ \min \begin \operatorname_(i-1,j) + 1 \\ \operatorname_(i,j-1) + 1 \\ \operatorname_(i-1,j-1) + 1_ \end & \text \end where $1\_$ is the indicator function equal to 0 when $a\_i\; =\; b\_j$ and equal to 1 otherwise, and $\backslash operatorname\_(i,j)$ is the distance between the first $i$ characters of $a$ and the first $j$ characters of $b$. Note that the first element in the minimum corresponds to deletion (from $a$ to $b$), the second to insertion and the third to match or mismatch, depending on whether the respective symbols are the same. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Levenshtein distance」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.